On rank-width of even-hole-free graphs
نویسندگان
چکیده
Isolde Adler Ngoc Khang Le Haiko Müller Marko Radovanović Nicolas Trotignon Kristina Vušković 1 School of Computing, University of Leeds, United Kingdom 2 CNRS, ENS de Lyon, LIP, France 3 Université de Lyon, France 4 Faculty of Mathematics, University of Belgrade, Serbia 5 Faculty of Computer Science (RAF), Union University, Serbia received 5thDec. 2016, revised 1stAug. 2017, accepted 3rdAug. 2017.
منابع مشابه
Structure and algorithms for (cap, even hole)-free graphs
A graph is even-hole-free if it has no induced even cycles of length 4 or more. A cap is a cycle of length at least 5 with exactly one chord and that chord creates a triangle with the cycle. In this paper, we consider (cap, even hole)-free graphs, and more generally, (cap, 4-hole)-free odd-signable graphs. We give an explicit construction of these graphs. We prove that every such graph G has a ...
متن کاملOn the structure of (pan, even hole)-free graphs
A hole is a chordless cycle with at least four vertices. A pan is a graph which consists of a hole and a single vertex with precisely one neighbor on the hole. An even hole is a hole with an even number of vertices. We prove that a (pan, even hole)-free graph can be decomposed by clique cutsets into essentially unit circular-arc graphs. This structure theorem is the basis of our O(nm)-time cert...
متن کاملThread Graphs, Linear Rank-Width and Their Algorithmic Applications
Many NP-hard graph problems can be efficiently solved on graphs of bounded tree-width. Several articles have recently shown that the so-called rank-width parameter also allows efficient solution of most of these NP-hard problems, while being less restrictive than tree-width. On the other hand however, there exist problems of practical importance which remain hard on graphs of bounded rank-width...
متن کاملRank-width and tree-width of H-minor-free graphs
We prove that for any fixed r ≥ 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of their rank-width. We also present refinements of our bounds for other graph classes such as Kr-minor free graphs and graphs of bounded genus.
متن کاملDecomposition of even-hole-free graphs with star cutsets and 2-joins
In this paper we consider the class of simple graphs defined by excluding, as inducedsubgraphs, even holes (i.e. chordless cycles of even length). These graphs are known aseven-hole-free graphs. We prove a decomposition theorem for even-hole-free graphs, thatuses star cutsets and 2-joins. This is a significant strengthening of the only other pre-viously known decomposition of ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1611.09907 شماره
صفحات -
تاریخ انتشار 2016